Distributionally robust parallel machine ScheLoc problem under service level constraints
نویسندگان
چکیده
منابع مشابه
Discrete parallel machine makespan ScheLoc problem
Scheduling-Location (ScheLoc) Problems integrate the separate fields of scheduling and location problems. In ScheLoc Problems the objective is to find locations for the machines and a schedule for each machine subject to some production and location constraints such that some scheduling objective is minimized. In this paper we consider the Discrete Parallel Machine Makespan (DPMM) ScheLoc Probl...
متن کاملDistributionally Robust Stochastic Knapsack Problem
This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of information on random data is known, i.e., the firs...
متن کاملDistributionally robust stochastic shortest path problem
This paper considers a stochastic version of the shortest path problem, the Distributionally Robust Stochastic Shortest Path Problem(DRSSPP) on directed graphs. In this model, the arc costs are deterministic, while each arc has a random delay. The mean vector and the second-moment matrix of the uncertain data are assumed known, but the exact information of the distribution is unknown. A penalty...
متن کاملDistributionally Robust Reward-Risk Ratio Optimization with Moment Constraints
Reward-risk ratio optimization is an important mathematical approach in finance. We revisit the model by considering a situation where an investor does not have complete information on the distribution of the underlying uncertainty and consequently a robust action is taken to mitigate the risk arising from ambiguity of the true distribution. We consider a distributionally robust reward-risk rat...
متن کاملQuantitative Stability Analysis for Distributionally Robust Optimization with Moment Constraints
In this paper we consider a broad class of distributionally robust optimization (DRO for short) problems where the probability of the underlying random variables depends on the decision variables and the ambiguity set is defined through parametric moment conditions with generic cone constraints. Under some moderate conditions including Slater type conditions of cone constrained moment system an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.11.240